More than numbers: the power of graphs in meta-analysis.
نویسندگان
چکیده
In meta-analysis, the assessment of graphs is widely used in an attempt to identify or rule out heterogeneity and publication bias. A variety of graphs are available for this purpose. To date, however, there has been no comparative evaluation of the performance of these graphs. With the objective of assessing the reproducibility and validity of graph ratings, the authors simulated 100 meta-analyses from 4 scenarios that covered situations with and without heterogeneity and publication bias. From each meta-analysis, the authors produced 11 types of graphs (box plot, weighted box plot, standardized residual histogram, normal quantile plot, forest plot, 3 kinds of funnel plots, trim-and-fill plot, Galbraith plot, and L'Abbé plot), and 3 reviewers assessed the resulting 1,100 plots. The intraclass correlation coefficients (ICCs) for reproducibility of the graph ratings ranged from poor (ICC = 0.34) to high (ICC = 0.91). Ratings of the forest plot and the standardized residual histogram were best associated with parameter heterogeneity. Association between graph ratings and publication bias (censorship of studies) was poor. Meta-analysts should be selective in the graphs they choose for the exploration of their data.
منابع مشابه
Practice of Epidemiology More Than Numbers: The Power of Graphs in Meta-Analysis
In meta-analysis, the assessment of graphs is widely used in an attempt to identify or rule out heterogeneity and publication bias. A variety of graphs are available for this purpose. To date, however, there has been no comparative evaluation of the performance of these graphs. With the objective of assessing the reproducibility and validity of graph ratings, the authors simulated 100 meta-anal...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملThe effectiveness of FOBT vs. FIT: A meta-analysis on colorectal cancer screening test
Background: After lung and prostate cancers, colorectal cancer (CRC) is the third most common cancer in men and the second most common cancer in women after breast cancer worldwide. Every year, more than one million people are diagnosed with colorectal cancer worldwide and half of these patients die from this disease, making it the fourth leading cause of death in the world. This systematic rev...
متن کاملClinical efficacy of local injection therapies for lateral epicondylitis: A systematic review and network meta-analysis
Background: We aimed to compare the efficacy of local injection therapies for lateral epicondylitis in a Bayesian framework. Methods: We searched the Embase, PubMed, Cochrane Central Register of Controlled Trials, Web of Science, Scopus, and ProQuest, for randomized controlled trials published from inception to February 2021 in any languages. The injection therapies included corticosteroids (C...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- American journal of epidemiology
دوره 169 2 شماره
صفحات -
تاریخ انتشار 2009